Optimal solution of neutrosophic linear fractional programming problems with mixed constraints

In this paper, linear fractional programming problems have been extended to neutrosophic sets, and the operations functionality of these laws are studied. Moreover, new algorithm is based on aggregation ranking function arithmetic triangular sets. Furthermore, in we take up a problem where constraints both equality inequality fuzzy number. Lead from genuine issue, few numerical models considered survey legitimacy, profitability materialness our technique. At last, some trials alongside one contextual analysis given show novel techniques better than current strategies.